On few-class Q-polynomial association schemes: feasible parameters and nonexistence results
نویسندگان
چکیده
We present the tables of feasible parameters primitive 3 -class Q -polynomial association schemes and 4 - 5 -bipartite (on up to 2800 , 10000 50000 vertices, respectively), accompanied by a number nonexistence results for such obtained analysing triple intersection numbers putative open cases.
منابع مشابه
On Q-Polynomial Association Schemes of Small Class
We show an inequality involving the third largest or second smallest dual eigenvalues of Q-polynomial association schemes of class at least three. Also we characterize dual-tight Q-polynomial association schemes of class three. Our method is based on tridiagonal matrices and can be applied to distance-regular graphs as well.
متن کاملImprimitive Q-polynomial Association Schemes
It is well known that imprimitive P -polynomial association schemes X = (X, {Ri}0≤i≤d) with k1 > 2 are either bipartite or antipodal, i.e., intersection numbers satisfy either ai = 0 for all i, or bi = cd−i for all i 6= [d/2]. In this paper, we show that imprimitiveQ-polynomial association schemesX = (X, {Ri}0≤i≤d) with d > 6 and k∗ 1 > 2 are either dual bipartite or dual antipodal, i.e., dual ...
متن کاملAssociation Schemes with Multiple Q-polynomial Structures
It is well known that an association scheme X = (X, {Ri}0≤i≤d) with k1 > 2 has at most two P polynomial structures. The parametrical condition for an association scheme to have twoP -polynomial structures is also known. In this paper, we give a similar result for Q-polynomial association schemes. In fact, if d > 5, then we obtain exactly the same parametrical conditions for the dual intersectio...
متن کاملOn nonsymmetric P- and Q-polynomial association schemes
If a nonsymmetric P-polynomial association scheme, or equivalently. a distanceregular digraph, has diameter d and girth g. then d = g or d = g 1, by Damerell’s theorem. The dual of this theorem was proved by Leonard. In this paper, we prove that the diameter of a nonsymmetric Pand Q-polynomial association scheme is one less than its girth and its cogirth. We also give a structure theorem for a ...
متن کاملNew families of Q-polynomial association schemes
In this paper, we construct the first known infinite family of primitive Qpolynomial schemes which are not generated by distance-regular graphs. To construct these examples, we introduce the notion of a relative hemisystem of a generalized quadrangle with respect to a subquadrangle.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Ars Mathematica Contemporanea
سال: 2021
ISSN: ['1855-3974', '1855-3966']
DOI: https://doi.org/10.26493/1855-3974.2101.b76